منابع مشابه
A Single-Pass Algorithm for Transitive Closure
One of the most attractive methods for computing the transitive closure of a binary relation is to apply depth-rst search to the corresponding directed graph, recognize the strongly connected components, and, at the same time, compute the successor lists for all nodes. Recognizing the strongly connected components is important because the straightforward successor list computation computes corr...
متن کاملA Parallel Algorithm for Transitive Closure
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O(mn p ) local memory. The local computation of each processor is equal to the product of the number of e...
متن کاملA Fault-Independent Transitive Closure Algorithm for Redundancy Identification
We present a fault-independent redundancy identification algorithm. The controllabilities and observabilities are defined as Boolean variables and represented on an implication graph. A major enhancement over previously published results is that we include all direct and partial implications, as well as node fixation. The transitive closure, whose computation now requires a new algorithm, provi...
متن کاملAn Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Fuzzy Proximity
A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...
متن کاملAn Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Proximity*
Equivalence relations are important in many branches of knowledge and especially in Classification theories and Cluster Analysis since they generate a partition on the universe of discourse and permit to classify their elements and make clusters. In many cases the relation we start with is not an equivalence relation but only a reflexive and symmetric one. A very important family of fuzzy relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 1970
ISSN: 0006-3835,1572-9125
DOI: 10.1007/bf01940892